A Large Scale Evolutionary Algorithm Based on Determinantal Point Processes for Large Scale Multi-Objective Optimization Problems
نویسندگان
چکیده
Global optimization challenges are frequent in scientific and engineering areas where loads of evolutionary computation methods i.e., differential evolution (DE) particle-swarm (PSO) employed to handle these problems. However, the performance algorithms declines due expansion problem dimension. The obstructed congregate with Pareto front rapidly while using large-scale algorithm. This work intends a multi-objective scheme aided by determinantal point process (LSMOEA-DPPs) this problem. proposed DPP model introduces mechanism consisting kernel matrix probability achieve convergence population variety high dimensional relationship balance keep diverse. We have also elitist non-dominated sorting for environmental selection. Moreover, projected algorithm demonstrates distinguishes four cutting-edge algorithms, each two three objectives, respectively, up 2500 decision variables. experimental results show that LSMOEA-DPPs outperform large margin.
منابع مشابه
A partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملNystrom Approximation for Large-Scale Determinantal Processes
Determinantal point processes (DPPs) are appealing models for subset selection problems where diversity is desired. They offer surprisingly efficient inference, including sampling in O(N) time and O(N) space, where N is the number of base items. However, in some applications, N may grow so large that sampling from a DPP becomes computationally infeasible. This is especially true in settings whe...
متن کاملA Compromise Decision-making Model for Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on the technique for order preference through similarity ideal solution (TOPSIS) methodology, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. This compromise programming method is ba...
متن کاملDecomposition-based evolutionary algorithm for large scale constrained problems
Cooperative Coevolutionary algorithms (CC) have been successful in solving large scale optimization problems. The performance of CC can be improved by decreasing the number of interdependent variables among decomposed subproblems. This is achieved by first identifying dependent variables, and by then grouping them in common subproblems. This approach has potential because so far no grouping tec...
متن کاملA Compromise Decision-Making Model Based on TOPSIS and VIKOR for Multi-Objective Large- Scale Nonlinear Programming Problems with A Block Angular Structure under Fuzzy Environment
This paper proposes a compromise model, based on a new method, to solve the multiobjectivelarge scale linear programming (MOLSLP) problems with block angular structureinvolving fuzzy parameters. The problem involves fuzzy parameters in the objectivefunctions and constraints. In this compromise programming method, two concepts areconsidered simultaneously. First of them is that the optimal alter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2022
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics11203317